Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
نویسندگان
چکیده
منابع مشابه
Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems
One of the major computational tasks of using the traditional cutting plane approach to solve linear semi-infinite programming problems lies in finding a global optimizer of a nonlinear and nonconvex program. This paper generalizes the Gustafson and Kortanek scheme to relax this requirement. In each iteration, the proposed method chooses a point at which the infinite constraints are violated to...
متن کاملRelaxed Cutting Plane Method for Solving Linear Semi-innnite Programming Problems
One of the major computational tasks of using the traditional cutting plane approach to solve linear semi-in nite programming problems lies in nding a global optimizer of a non-linear and non-convex program. This paper generalizes Gustafson and Kortanek's scheme to relax this requirement. In each iteration, the proposed method chooses a point at which the in nite constraints are violated to a d...
متن کاملSolving Standard Quadratic Programming by Cutting Planes
Standard quadratic programs are non-convex quadratic programs with the only constraint that variables must belong to a simplex. By a famous result of Motzkin and Straus, those problems are connected to the clique number of a graph. In this paper, we study cutting plane techniques to obtain strong bounds for standard quadratic programs. Our cuts are derived in the context of a Spatial Branch & B...
متن کاملApplication of general semi-infinite programming to lapidary cutting problems
We consider a volume maximization problem arising in gemstone cutting industry. The problem is formulated as a general semi-infinite program (GSIP ) and solved using an interiorpoint method developed by Stein. It is shown, that the convexity assumption needed for the convergence of the algorithm can be satisfied by appropriate modelling. Clustering techniques are used to reduce the number of co...
متن کاملSolving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks
Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. Then, we use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2001
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00544-6